منابع مشابه
On Finding Lekkerkerker-Boland Subgraphs
Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a lineartime algorithm to find one in any graph that is not an interval graph. Tucker characterized the minimal forbidden submatrices of matrices that do not have the consecutive-ones property. We give a linear-time algorithm to find one in any matrix that does not have the co...
متن کاملAll That Jazz : Três Aplicações Do Conceito
The theme of improvisation constitutes an emerging topic in the field of management and organizations. The concept entered organization studies in association with the jazz metaphor but, due to the growing number of empirical studies, it is acquiring an increasing level of prominence and instrumental value. This article discusses the relationship between jazz music and management studies. It st...
متن کاملQualis 2011‐2013 ‐ os três erres
O intenso debate suscitado pela implantação do NovoQualis, que regeu a avaliação CAPES relativa ao triênio 2008-2010 evidencia as dúvidas e controvérsias geradas na comunidade cientı́fica. Não cabe agora retomar aquela temática, pois águas passadas não movem moinhos. Porém, o debate patrocinado pela FAPESP e pela BIREME em 12 de setembro passado levantou questões que parecem ser de consenso e qu...
متن کاملProblemas com modelagem álgebrica: três exemplos para semestres iniciais
This paper describes three programming problems that are simple enough to be used in the beginning of a CS undergraduate program but also interesting enough to be worth exploring with different approaches. We are able to apply a mixture of programming practices, abstraction and algebraic approaches to the problems, so that these subjects may be presented as complementary and allowing for clear ...
متن کاملA generalization of the theorem of Lekkerkerker and Boland
Each fixed graph H gives rise to a list H-colouring problem. The complexity of list H-colouring problems has recently been fully classified: if H is a bi-arc graph, the problem is polynomial-time solvable, and otherwise it is NP-complete. The proof of this fact relies on a forbidden substructure characterization of bi-arc graphs, reminiscent of the theorem of Lekkerkerker and Boland on interval...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cadernos de Literatura em Tradução
سال: 2007
ISSN: 2359-5388,1981-2558
DOI: 10.11606/issn.2359-5388.i8p203-213